Experiments on Optimally Solving NP-complete Problems on Planar Graphs
نویسندگان
چکیده
منابع مشابه
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Maximum Common Induced Subgraph (henceforth MCIS) is among the most studied classical NP-hard problems. MCIS remains NP-hard on many graph classes including bipartite graphs, planar graphs and k-trees. Little is known, however, about the parameterized complexity of the problem. When parameterized by the vertex cover number of the input graphs, the problem was recently shown to be fixed-paramete...
متن کاملSolving the Rubik's Cube Optimally is NP-complete
In this paper, we prove that optimally solving an n × n × n Rubik’s Cube is NP-complete by reducing from the Hamiltonian Cycle problem in square grid graphs. This improves the previous result that optimally solving an n×n×n Rubik’s Cube with missing stickers is NP-complete. We prove this result first for the simpler case of the Rubik’s Square—an n× n× 1 generalization of the Rubik’s Cube—and th...
متن کاملInterdiction Problems on Planar Graphs
We introduce approximation algorithms and strong NP-completeness results for interdiction problems on planar graphs. Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded graph. We give a multiplicative (1+ǫ)-approxi...
متن کاملExperimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Many NP-complete problems on planar graphs are “fixed-parameter tractable:” Recent theoretical work provided tree decomposition based fixed-parameter algorithms exactly solving various parameterized problems on planar graphs, among others Vertex Cover, in time O(c √ kn). Here, c is some constant depending on the graph problem to be solved, n is the number of graph vertices, and k is the problem...
متن کاملHard coloring problems in low degree planar bipartite graphs
In this paper we prove that the PRECOLORING EXTENSION problem on graphs of maximum degree 3 is polynomially solvable, but even its restricted version with 3 colors is NP-complete on planar bipartite graphs of maximum degree 4. The restricted version of LIST COLORING, in which the union of all lists consists of 3 colors, is shown to be NP-complete on planar 3-regular bipartite graphs. © 2006 Els...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007